New variations of the maximum coverage facility location problem

نویسندگان
چکیده

منابع مشابه

The Maximum Facility Location Problem

In the maximum facility location problem, we are given a set of clients C and facilities F . Assigning a client u to a facility v incurs a cost w uv and each facility has an associated interval I v on the real line. Our goal is to assign as many clients to open facilities in order to maximise the cost of assignment, subject to the constraint that open facilities cannot have their respective int...

متن کامل

New variations of the reverse facility location problem

In this paper we consider a natural extension of the socalled reverse facility location problem which was introduced by Cabello et al. [3]. Given a set of n users and a set of m facilities, where a user takes service from its nearest facility, the objective is to place two new facilities such that the total number of users served by these two new facilities is maximized. We refer to this proble...

متن کامل

Capacitated Facility Location Problem with Variable Coverage Radius in Distribution System

  The problem of locating distribution centers (DCs) is one of the most important issues in design of supply chain. In previous researches on this problem, each DC could supply products for all of the customers. But in many real word problems, DCs can only supply products for customers who are in a certain distance from the facility, coverage radius. Thus, in this paper a multi-objective intege...

متن کامل

On the facility location problem: One-round weighted Voronoi game

Voronoi game presents a simple geometric model for Competitive facility location problems with two players. Voronoi game is played by two players known as White and Black, they play in a continuous arena. In the one-round game, White starts game and places all his points in the arena then Black places her points. Then the arena is divided by distance between two players and the player with the ...

متن کامل

The Kinetic Facility Location Problem

We present a deterministic kinetic data structure for the facility location problem that maintains a subset of the moving points as facilities such that, at any point of time, the accumulated cost for the whole point set is at most a constant factor larger than the current optimal cost. At any point of time, the cost that arise for a point depends on the status and the position of the point. In...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Operational Research

سال: 2013

ISSN: 0377-2217

DOI: 10.1016/j.ejor.2012.08.009